Constraint Solving Approach to Schedulability Analysis in Real-Time Systems
نویسندگان
چکیده
منابع مشابه
A Generic Approach to Schedulability Analysis of Real-Time Systems
Fersman, E. 2003: A Generic Approach to Schedulability Analysis of Real-Time Systems. Acta Universitatis Upsaliensis Uppsala Dissertations from the Faculty of Science and Technology 49. 162 pp. Uppsala. ISBN 91-554-5774-6 This thesis presents a framework for design, analysis, and implementation of embedded systems. We adopt a model of timed automata extended with asynchronous processes i.e. tas...
متن کاملSchedulability Analysis of Real-Time Systems under Uncertainty: Fuzzy Approach
This paper analyses the schedulability of realtime systems with uncertain knowledge. Fuzzy numbers are used to model parameters describing tasks, providing information about observation of the tasks deadlines at early phases of development. In this paper fuzzy schedulability and a fuzzy optimality criteria are defined and the fuzzy optimality of Deadline Monotonic Scheduling algorithm is proved...
متن کاملSymbolic Schedulability Analysis of Real-Time Systems
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of a scheduling problem as a process that has parameters of the problem as free variables. The specification is analyzed by means of a symbolic algorithm. The outcome of the anal...
متن کاملSchedulability Analysis of Hierarchical Real-Time Systems
Embedded systems are complex as a whole but consist of smaller independent modules interacting with each other. This structure makes embedded systems amenable to compositional design. Real-time embedded systems consist of real-time workloads having temporal deadlines. Compositional design of real-time embedded systems can be done using systems consisting of real-time components arranged in a sc...
متن کاملA Generic Approach to Schedulability Analysis of Real-Time Tasks
In off-line schedulability tests for real time systems, tasks are usually assumed to be periodic, i.e. they are released with fixed rates. To relax the assumption of complete knowledge on arrival times, we propose to use timed automata to describe task arrival patterns. In a recent work, it is shown that for fixed priority scheduling strategy and tasks with only timing constraints (i.e. executi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2874637